Emerging Patterns in Global Telecommunications Alliances and Mergers
نویسندگان
چکیده
منابع مشابه
Joint Ventures, Strategic Alliances, and Collaboration in Telecommunications
Joint ventures among telecommunications firms have become increasingly common in recent years. These joint ventures have occurred in almost all areas of telecommunications including information services, manufacturing, and mobile service. The firms involved in the collaboration have often been domestic U.S. corporations, such as AT&T and GTE, or international corporations, such as GPT (General ...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملCoronavirus: Discover the Structure of Global Knowledge, Hidden Patterns & Emerging Events
Background & Objective: The present study aimed at exploring the structure of global knowledge, hidden patterns, and emerging Coronavirus events using co-word techniques. Co-word analysis is one of the most efficient scientific methods to analyze the structure and dynamics of knowledge and the general state of research. Materials & Methods: This applied research performed using Co-word anal...
متن کاملMergers, Acquisitions and Control of Telecommunications Firms in Europe
Evidence is presented on twelve large acquisitions by telecommunications firms in Europe. Although the average effect on acquirers’ shareholder value is not significantly different from zero, there is high dispersion in the results. This suggests that detailed studies may uncover important aspects of the constraints that exist in the corporate control market of telecommunications firms. A case ...
متن کاملGlobal Defensive Alliances in Graphs
A defensive alliance in a graph G = (V,E) is a set of vertices S ⊆ V satisfying the condition that for every vertex v ∈ S, the number of neighbors v has in S plus one (counting v) is at least as large as the number of neighbors it has in V − S. Because of such an alliance, the vertices in S, agreeing to mutually support each other, have the strength of numbers to be able to defend themselves fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial and Corporate Change
سال: 1998
ISSN: 0960-6491,1464-3650
DOI: 10.1093/icc/7.4.695